Achieving Hash Table Searches In One Or Two Bucket Probes
نویسندگان
چکیده
منابع مشابه
An Algorithm to Reduce the Communication Traffic for Multi-Word Searches in a Distributed Hash Table
In distributed hash tables, much communication traffic comes from multi-word searches. The aim of this work is to reduce the amount of traffic by using a bloom filter, which is a space-efficient probabilistic data structure used to test whether or not an element is a member of a set. However, bloom filters have a limited role if several sets have different numbers of elements. In the proposed m...
متن کاملMaidSafe Distributed Hash Table
An effective distributed network requires an addressing mechanism and distribution of data that is designed to overcome churn (the unmanageable outage, node failure or unforeseen communication fault). There are several implementations of such a system, but this paper proposes a system that not only provides an efficient churn-resistant DHT, but also has fast awareness of infrastructure changes....
متن کاملA Distributed Hash Table
DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from re-implementing mechanisms common to any system that stores data on a collection of machines: it maintains a mapping of objects to servers, replicates data for durability, and balances load across parti...
متن کاملPerformance Analysis of Multi-threaded Locking in Bucket Hash Tables
Data structures, such as hash tables, are often accessed from within critical sections in multi-threaded environments in order to preserve data integrity. The extent of mutual exclusion greatly affects the performance by limiting the level of achievable parallelism. Increasing the resolution of locking allows higher throughput at the cost of increased memory use with all its side effects. Highl...
متن کاملA Parallel Compact Hash Table
We present the first parallel compact hash table algorithm. It delivers high performance and scalability due to its dynamic regionbased locking scheme with only a fraction of the memory requirements of a regular hash table.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1985
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/28.3.313